Predicting queue wait time probabilities for multi-scale computing
نویسندگان
چکیده
منابع مشابه
Resource Selection Using Execution and Queue Wait Time Predictions
Computational grids provide users with many possible places to execute their applications. We wish to help users select where to run their applications by providing predictions of the execution times of applications on space shared parallel computers and predictions of when scheduling systems for such parallel computers will start applications. Our predictions are based on instance based learni...
متن کاملWaiting time probabilities in the M/G/1 +M queue
We consider an M/G/1 queueing system where the customers may leave the queue if their services do not commence before an exponentially distributed random time. The (conditional) offered waiting time distribution is approximated by a gamma distribution via matching the first and second moments of the actual waiting time. Simulation study is conducted to assess the accuracy of the approximation a...
متن کاملExplorer A polynomial time algorithm for computing extinction probabilities of multi - type branching processes
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...
متن کاملA Single-Enqueuer Wait-Free Queue Implementation
We study wait-free linearizable Queue implementations in asynchronous shared-memory systems from other consensus number 2 objects, such as Fetch&Add and Swap. The best previously known implementation allows at most two processes to perform Dequeue operations. We provide a new implementation, when only one process performs Enqueue operations and any number of processes perform Dequeue operations...
متن کاملWait-free Computing
Abs t r ac t . This tutorial has two independent parts. The first part (Sections 1, 2, 3, and 4) is aimed at introducing beginning graduate students to the subject of wait-free synchronization. It explores some important questions that have been studied and the techniques to solve them. The second part (Section 5) is a tutorial on robust walt-free hierarchies. It explains the motivation for stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2019
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2018.0151